Exchangeable Optimal Transportation and Log-concavity

نویسنده

  • ALEXANDER V. KOLESNIKOV
چکیده

We study the Monge and Kantorovich transportation problems on R∞ within the class of exchangeable measures. With the help of the de Finetti decomposition theorem the problem is reduced to an unconstrained optimal transportation problem on a Hilbert space. We find sufficient conditions for convergence of finite-dimensional approximations to the Monge solution. The result holds, in particular, under certain analytical assumptions involving logconcavity of the target measure. As a by-product we obtain the following result: any uniformly log-concave exchangeable sequence of random variables is i.i.d.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Negative correlation and log-concavity

OF THE DISSERTATION Negative correlation and log-concavity by Michael Neiman Dissertation Director: Jeff Kahn This thesis is concerned with negative correlation and log-concavity properties and relations between them, with much of our motivation provided by [40], [46], and [12]. Our main results include a proof that “almost exchangeable” measures satisfy the “FederMihail” property; counterexamp...

متن کامل

Khinchine Type Inequalities with Optimal Constants via Ultra Log-concavity

We derive Khinchine type inequalities for even moments with optimal constants from the result of Walkup ([15]) which states that the class of log-concave sequences is closed under the binomial convolution. log-concavity and ultra log-concavity and Khinchine inequality and factorial moments

متن کامل

Optimal Design and -Concavity

Tools from advanced real analysis and the Prékopa-Borell Theorem are combined to derive a tight sufficient condition for regularity (R. Myerson, Optimal auction design, Mathematics of Operations Research 6, 1981, pp. 58-73). The conventional log-concavity condition arises as a special case. The approach allows various generalizations, for instance to multidimensional types. Regularity is verifi...

متن کامل

Strong log-concavity is preserved by convolution

We review and formulate results concerning strong-log-concavity in both discrete and continuous settings. Although four different proofs of preservation of strong log-concavity are known in the discrete setting (where strong log-concavity is known as “ultra-log-concavity”), preservation of strong log-concavity under convolution has apparently not been investigated previously in the continuous c...

متن کامل

Combinatorial conjectures that imply local log-concavity of graph genus polynomials

The 25-year old LCGD Conjecture is that the genus distribution of every graph is log-concave. We present herein a new topological conjecture, called the Local Log-Concavity Conjecture. We also present a purely combinatorial conjecture, which we prove to be equivalent to the Local Log-Concavity Conjecture. We use the equivalence to prove the Local Log-Concavity Conjecture for graphs of maximum d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016